An Intelligent Optimization Algorithm for Blocking Flow-Shop Scheduling Based on Differential Evolution
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملFlow shop scheduling using enhanced differential evolution algorithm
This paper presents a new approach of differential evolution to scheduling optimization problem. The developed approach is viewed as an enhanced varient of differential evolution, incorporation new child correction schemas and coversion schemas from differential to discrete domain. The heuristic is extensively evaluated with the scheduling problem of flow shop and compared with published result...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملFlow Shop Scheduling Using Clustered Differential Evolution
A generic approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Differential Evolution Algorithm is embedded with a population based on this approach and vetted with the Flow shop scheduling problem. Extensive ex...
متن کاملAn effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers
In this paper, an effective hybrid discrete differential evolution (HDDE) algorithm is proposed to minimize the maximum completion time (makespan) for a flow shop scheduling problem with intermediate buffers located between two consecutive machines. Different from traditional differential evolution algorithms, the proposed HDDE algorithm adopted job permutation to represent individuals and appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation Modelling
سال: 2019
ISSN: 1726-4529
DOI: 10.2507/ijsimm18(4)co16